Finite-State Transducers as Regular Böhm Trees
نویسندگان
چکیده
We present a uniform translation from finite-state transducers to regular Böhm trees presentations. The corresponding Böhm tree represents directly the trace semantics of all finite and infinite behaviours of the given transducer. We consider variations on this basic idea, and generalisations of finite-state transducers suggested by the general formalism of regular Böhm trees. This work suggests the use of recursive Böhm trees combinators as a machine-language for reactive programming.
منابع مشابه
Compilation of Weighted Finite-State Transducers from Decision Trees
We report on a method for compiling decision trees into weighted finite-state transducers. The key assumptions are that the tree predictions specify how to rewrite symbols from an input string, and the decision at each tree node is stateable in terms of regular expressions on the input string. Each leaf node can then be treated as a separate rule where the left and right contexts are constructa...
متن کاملOmega-Regular Model Checking
“Regular model checking” is the name of a family of techniques for analyzing infinite-state systems in which states are represented by words or trees, sets of states by finite automata on these objects, and transitions by finite automata operating on pairs of state encodings, i.e. finite-state transducers. In this context, the central problem is then to compute the iterative closure of a finite...
متن کاملTree Automata and Tree Grammars
Preface I wrote these lecture notes during my stay in Aarhus in the academic year 1974/75. As a young researcher I had a wonderful time at DAIMI, and I have always been happy to have had that early experience. I wish to thank Heiko Vogler for his noble plan to move these notes into the digital world, and I am grateful to Florian Starke and Markus Napierkowski (and Heiko) for the excellent trans...
متن کاملA Note on the Complexity of Optimality Theory
Optimality theory (OT), introduced by Prince and Smolensky (1993), is a linguistic framework in which the mapping of one level of linguistic representation to another is based on rules and filters. The rules generate candidate expressions in the target representation, which are subsequently checked against the filters, so that only those candidates remain that survive this filtering process. Ge...
متن کاملOn Tree Transducers for Partial Functions
In [4, Theorem X7.11 it is shown that if a partial function can be realized by a (nondeterministic) finite state a-transducer, then it can also be realized by a (deterministic) generalized bimachine (introduced in [l 11). Thus the generalized bimachines compute precisely all partial functions which are realizable by a-transducers. It can easily be shown that instead of a generalized bimachine (...
متن کامل